Semidefinite Programming Algorithms for 3-D AOA-Based Hybrid Localization
نویسندگان
چکیده
By taking different kinds of measurements at the same time, it may be possible to improve accuracy target localization or reduce number sensors needed. Time-of-arrival (TOA), time-difference-of-arrival (TDOA), time delay (TD), received signal strength (RSS), and angle-of-arrival (AOA) are commonly used in wireless systems. This article first presents a new weighted least squares (WLS) algorithm for AOA-only problem. Then, unified solution based on semidefinite programming (SDP) is developed hybrid AOA/TOA, AOA/TDOA, AOA/TD, AOA/RSS problems. Additionally, thorough simulation results show that proposed SDP algorithms perform better than state-of-the-art techniques.
منابع مشابه
Exploiting geometry for improved hybrid AOA/TDOA-based localization
In this paper we examine the geometrically constrained optimization approach to localization with hybrid bearing (angle of arrival, AOA) and time difference of arrival (TDOA) sensors. In particular, we formulate a constraint on the measurement errors which is then used along with constraint-based optimization tools in order to estimate the maximum likelihood values of the errors given an approp...
متن کاملDerandomizing Semidefinite Programming Based Approximation Algorithms
Remarkable breakthroughs have been made recently in obtaining approximate solutions to some fundamental NP Complete problems namely Max Cut Max k Cut Max Sat Max Dicut Max Bisection k Vertex Coloring Independent Set etc These breakthroughs all involve polynomial time randomized algorithms based upon Semide nite Programming a technique pioneered by Goemans and Williamson In this paper we give te...
متن کاملDerandomizing Approximation Algorithms Based on Semidefinite Programming
Remarkable breakthroughs have been made recently in obtaining approximate solutions to some fundamental NP-hard problems, namely Max-Cut, Max k-Cut, Max-Sat, Max-Dicut, Max-bisection, k-vertex coloring, maximum independent set, etc. All these breakthroughs involve polynomial time randomized algorithms based upon semidefinite programming, a technique pioneered by Goemans and Williamson. In this ...
متن کاملSemidefinite Programming Based Algorithms for the Sparsest Cut Problem
In this paper we analyze a known relaxation for the Sparsest Cut Problem based on positive semidefinite constraints, and we present a branch and bound algorithm and heuristics based on this relaxation. The relaxed formulation and the algorithms were tested on small and moderate sized instances. It leads to values very close to the optimum solution values. The exact algorithm could obtain soluti...
متن کاملTarget following Algorithms for Semidefinite Programming
We present a target-following framework for semidefinite programming, which generalizes the target-following framework for linear programming. We use this framework to build weighted path-following interior-point algorithms of three distinct flavors: short-step, predictor-corrector, and large-update. These algorithms have worst-case iteration bounds that parallel their counterparts in linear pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE open journal of signal processing
سال: 2023
ISSN: ['2644-1322']
DOI: https://doi.org/10.1109/ojsp.2023.3279010